package com.zsj.Tets;

import java.math.BigInteger;

/**
 * @auther zsj
 * @Date 2021/12/15
 **/
public class test {
    public static void main(String[] args) {
        BigInteger count = new BigInteger("0");
        BigInteger b = new BigInteger("2");
        for (int i = 0; i < 64; i++) {
            count = count.add(b.pow(i));
        }

    }


    private static int count(int n) {
        if (n < 5) {
            return n;
        } else {
            int temp[] = new int[n + 1];
            temp[1] = 1;
            temp[2] = 2;
            temp[3] = 3;
            temp[4] = 4;
            for (int i = 5; i <= n; i++) {
                temp[i] = temp[i - 1] + temp[i - 3];
            }
            return temp[n];
        }
    }

    public int countOdds(int low, int high) {
        int count = 0;
        if (low % 2 != 0) {
            count += 1;
            while (low < high && low == high) {
                low += 2;
                count++;
            }
        }
        return count;
    }

}
